The Foldings of a Square to Convex Polyhedra
نویسندگان
چکیده
The structure of the set of all convex polyhedra foldable from a square is detailed. It is proved that five combinatorially distinct nondegenerate polyhedra, and four different flat polyhedra, are realizable. All the polyhedra are continuously deformable into each other, with the space of polyhedra having the topology of four connected rings.
منابع مشابه
Modelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملPlanar Drawings of Origami Polyhedra
This work studies the structure of origami bases via graph drawings of origami polyhedra. In particular, we propose a new class of polyhedra, called extreme-base polyhedra, that capture the essence of \extreme" origami bases. We develop a linear-time algorithm to nd the \natural" straight-line planar drawing of these polyhedra. This algorithm demonstrates a recursive structure in the polyhedra ...
متن کاملFolding and Unfolding
The results of this thesis concern folding of one-dimensional objects in two dimensions: planar linkages. More precisely, a planar linkage consists of a collection of rigid bars (line segments) connected at their endpoints. Foldings of such a linkage must preserve the connections at endpoints, preserve the bar lengths, and (in our context) prevent bars from crossing. The main result of this the...
متن کاملOrigamizer: A Practical Algorithm for Folding Any Polyhedron
It was established at SoCG’99 that every polyhedral complex can be folded from a sufficiently large square of paper, but the known algorithms are extremely impractical, wasting most of the material and making folds through many layers of paper. At a deeper level, these foldings get the topology wrong, introducing many gaps (boundaries) in the surface, which results in flimsy foldings in practic...
متن کاملFlat 2-Foldings of Convex Polygons
A folding of a simple polygon into a convex polyhedron is accomplished by glueing portions of the perimeter of the polygon together to form a polyhedron. A polygon Q is a flat n-folding of a polygon P if P can be folded to exactly cover the surface of Q n times, with no part of the surface of P left over. In this paper we focus on a specific type of flat 2-foldings, flat 2-foldings that wrap Q;...
متن کامل